Linear time algorithms for linear programming

Fuzzy Primal Simplex Algorithms for Solving Fuzzy Linear Programming Problems

Randomized Algorithms for Linear Programming

Linear Time Algorithms for Some Separable Quadratic Programming Problems

A large class of separable quadratic programming problems is presented The problems in the class can be solved in linear time The class in cludes the separable convex quadratic transportation problem with a xed number of sources and separable convex quadratic programming with nonnegativity con straints and a xed number of linear equality constraints

A goal programming approach for fuzzy flexible linear programming problems

 We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...

Augmentation Algorithms for Linear and Integer Linear Programming

Motivated by Bland’s linear-programming generalization of the renowned Edmonds-Karp efficient refinement of the Ford-Fulkerson maximum-flow algorithm, we present three closely related natural augmentation rules for linear and integer linear optimization. In several nice situations, we show that polynomially many augmentation steps suffice to reach an optimum. In particular, when using “discrete...